package Day2025_03_12;

public class LeetCode63 {
    public int uniquePathsWithObstacles(int[][] ob) {
        int m = ob.length, n = ob[0].length;
        int[][] dp = new int[m][n];
        for (int i = 0; i < m; i++) {
            if (ob[i][0] == 0) dp[i][0] = 1;
            else break;
        }
        for (int i = 0; i < n; i++) {
            if (ob[0][i] == 0) dp[0][i] = 1;
            else break;
        }
        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                if (ob[i][j] == 1) dp[i][j] = 0;
                else dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
            }
        }
        return dp[m - 1][n - 1];
    }
}
